The number of different words that can be formed using all the letters of the word $APPLICATION$ such that no two vowels come together is -

If ${}^n P_r = 30240$ and ${}^n C_r = 252$,then the ordered pair $(n, r)$ is equal to

The number of all five-letter words (with or without meaning) having at least one repeated letter that can be formed by using the letters of the word $INCONVENIENCE$ is:

For integers $n$ and $r$,let $\binom{n}{r} = \begin{cases} ^{n}C_{r}, & \text{if } n \geq r \geq 0 \\ 0, & \text{otherwise} \end{cases}$. The maximum value of $k$ for which the sum $\sum_{i=0}^{k}\binom{10}{i}\binom{15}{k-i} + \sum_{i=0}^{k+1}\binom{12}{i}\binom{13}{k+1-i}$ exists,is equal to ...... .

$A$ number is called a palindrome if it reads the same backward as well as forward. For example,$285582$ is a six-digit palindrome. The number of six-digit palindromes,which are divisible by $55$,is ...... .

All the letters of the word $TABLE$ are permuted and the strings of letters (may or may not have meaning) thus formed are arranged in dictionary order. Then the rank of the word $TABLE$ counted from the rank of the word $BLATE$ is